Fast algorithms for spherical harmonic expansions, II

نویسنده

  • Mark Tygert
چکیده

We provide an efficient algorithm for calculating, at appropriately chosen points on the two-dimensional surface of the unit sphere in R, the values of functions that are specified by their spherical harmonic expansions (a procedure known as the inverse spherical harmonic transform). We also provide an efficient algorithm for calculating the coefficients in the spherical harmonic expansions of functions that are specified by their values at these appropriately chosen points (a procedure known as the forward spherical harmonic transform). The algorithms are numerically stable, and, if the number of points in our standard tensor-product discretization of the surface of the sphere is proportional to l, then the algorithms have costs proportional to l ln(l) at any fixed precision of computations. Several numerical examples illustrate the performance of the algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Algorithms for Spherical Harmonic Expansions

An algorithm is introduced for the rapid evaluation at appropriately chosen nodes on the two-dimensional sphere S2 in R3 of functions specified by their spherical harmonic expansions (known as the inverse spherical harmonic transform), and for the evaluation of the coefficients in spherical harmonic expansions of functions specified by their values at appropriately chosen points on S2 (known as...

متن کامل

Fast algorithms for spherical harmonic expansions, III

We accelerate the computation of spherical harmonic transforms, using what is known as the butterfly scheme. This provides a convenient alternative to the approach taken in the second paper from this series on “Fast algorithms for spherical harmonic expansions.” The requisite precomputations become manageable when organized as a “depth-first traversal” of the program’s control-flow graph, rathe...

متن کامل

A fast and stable method for rotating spherical harmonic expansions

In this paper, we present a simple and efficient method for rotating a spherical harmonic expansion. This is a well-studied problem, arising in classical scattering theory, quantum mechanics and numerical analysis, usually addressed through the explicit construction of the Wigner rotation matrices. We show that rotation can be carried out easily and stably through ‘‘pseudospectral” projection, ...

متن کامل

Cone-beam and fan-beam image reconstruction algorithms based on spherical and circular harmonics.

A cone-beam image reconstruction algorithm using spherical harmonic expansions is proposed. The reconstruction algorithm is in the form of a summation of inner products of two discrete arrays of spherical harmonic expansion coefficients at each cone-beam point of acquisition. This form is different from the common filtered backprojection algorithm and the direct Fourier reconstruction algorithm...

متن کامل

Spherical tensor approach to multipole expansions. II. Magnetostatic interactions

The magnetic field due to a given current distribution, the interaction energy of a current distribution with an arbitrary external magnetic field, and the magnetostatic interaction energy between two current distributions are decomposed into multipolar components using spherical harmonic expansions. Diamagnetic interactions and the spin contributions to the multipole expansions are also discus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Physics

دوره 227  شماره 

صفحات  -

تاریخ انتشار 2008